From Application Models to Filmstrip Models: An Approach to Automatic Validation of Model Dynamics M. Gogolla1 , L. Hamann1 , F. Hilken1∗, M. Kuhlmann1 , R. France2 1 {gogolla,lhamann,fhilken,mk}@informatik.uni-bremen

Source URL: www.db.informatik.uni-bremen.de

• Software engineering
• Theoretical computer science
• Unified Modeling Language
• Computing
• Formal methods
• Object Constraint Language
• ECO
• Postcondition
• Object diagram
• Object Process Methodology
• Class diagram
• Invariant

MizarMode - An Integrated Proof Assistance Tool for the Mizar Way of Formalizing Mathematics Josef Urban 1 Dept. of Theoretical Computer Science Charles University

Source URL: jurban.github.io

TECHN ICA L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN UND A RTIFICIAL I NTELLIGENCE

Source URL: www.dbai.tuwien.ac.at

• Logic
• Theoretical computer science
• Mathematics
• Logic in computer science
• Argumentation framework
• Artificial intelligence
• Model theory
• Semantics
• Structure
• Denotational semantics

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

• Machine learning
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Learning
• Models of computation
• Property testing
• Decision tree model
• Sample complexity
• PP
• Probability distribution
• Time complexity

Exploring Promising Stepping Stones by Combining Novelty Search with Interactive Evolution Brian G. Woolley and Kenneth O. Stanley , arXiv:1207.6682v1 [cs.NE] 28 Jul 2012

Source URL: eplex.cs.ucf.edu

• Evolutionary computation
• Evolutionary algorithms
• Evolution
• Applied mathematics
• Artificial intelligence
• Cybernetics
• Interactive evolutionary computation
• Theoretical computer science
• Neuroevolution of augmenting topologies
• Neuroevolution
• Mathematical optimization
• Fitness landscape

The EATCS Award 2013 Call for Nominations The European Association for Theoretical Computer Science (EATCS) annually honours a respected scientist from our community with the prestigious EATCS Distinguished Achievement A

Source URL: www.ru.is

Towards a Theoretical Foundation for Laplacian-Based Manifold Methods Mikhail Belkin and Partha Niyogi The University of Chicago, Department of Computer Science {misha, niyogi}@cs.uchicago.edu

Source URL: people.cs.uchicago.edu

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

CalculemusThe 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning Calculemus 2009 Emerging Trends

Source URL: www.calculemus.net

• Theoretical computer science
• Algorithm
• Correctness
• RSA
• Metamath
• Symbolic computation
• Recursion

Mechanized Verification of Fine-grained Concurrent Programs st * Consi PLDI *

Source URL: ilyasergey.net

• Theoretical computer science
• Mathematics
• Knowledge representation
• Tree
• Engineering
• Minimum spanning tree
• Graph
• Separation logic
• Topology